Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata
نویسندگان
چکیده
منابع مشابه
Two-Way Two-Tape Automata
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alterna...
متن کاملThe Reduction of Two-Way Automata to One-Way Automata
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction rather than on crossing sequence analysis.
متن کاملUnary Languages Recognized by Two-Way One-Counter Automata
A two-way deterministic finite state automaton with one counter (2D1CA) is a fundamental computational model that has been examined in many different aspects since sixties, but we know little about its power in the case of unary languages. Up to our knowledge, the only known unary nonregular languages recognized by 2D1CAs are those formed by strings having exponential length, where the exponent...
متن کاملTwo-way Quantum One-counter Automata
After the rst treatments of quantum nite state automata by Moore and Crutch eld and by Kondacs and Watrous, a number of papers study the power of quantum nite state automata and their variants. This paper introduces a model of two-way quantum one-counter automata (2Q1CAs), combining the model of two-way quantum nite state automata (2QFAs) by Kondacs and Watrous and the model of one-way quantum ...
متن کاملDeterminizing Two-way Alternating Pebble Automata for Data Languages
We prove that for every integer k ≥ 1, two-way alternating kpebble automata and one-way deterministic k-pebble automata for data languages have the same recognition power.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1981
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0210027